منابع مشابه
The Fabulous (11,5, 2) Biplane
After a workshop for new teaching assistants on innovations in teaching, a new sociology graduate student wandered into my office and asked the question, " Tell me. .. how do you make math exciting for students? " By chance, I just happened to have on my computer screen a picture that exhibits some of the symmetries of one of the most intriguing objects in mathematics: the (11, 5, 2) biplane. F...
متن کاملMonoplane versus Biplane
HERE is no question in the development of aviation more interesting to the average observer than the relative value of the biplane and the monoplane. Types of both have so multiplied and differentiated that the man on the street can no longer distinguish at sight, say, a Nieuport from any other of the monoplanes to which Bleriot accustomed him, or pick out a Farman, a Sommer, a Voisin, from oth...
متن کاملCharles F. Curtiss, 1863-1946: a brief biography.
The title Dean of Agriculture in our land-grant system has been given to many great men. Some have had the opportunity and innate ability to create. One such leader was Dean Charles F. Curtiss of Iowa State College ( ISO. Among his many other monumental contributions, the most important was described by C. L. Burlingham, a student, at the dinner held at the Saddle and Sirloin Club in 1925 when ...
متن کاملGeometric Biplane Graphs II: Graph Augmentation
We study biplane graphs drawn on a finite point set S in the plane in general position. This is the family of geometric graphs whose vertex set is S and which can be decomposed into two plane graphs. We show that every sufficiently large point set admits a 5-connected biplane graph and that there are arbitrarily large point sets that do not admit any 6connected biplane graph. Furthermore, we sh...
متن کاملGeometric Biplane Graphs I: Maximal Graphs
We study biplane graphs drawn on a finite point set S in the plane in general position. This is the family of geometric graphs whose vertex set is S and can be decomposed into two plane graphs. We show that two maximal biplane graphs—in the sense that no edge can be added while staying biplane—may differ in the number of edges, and we provide an efficient algorithm for adding edges to a biplane...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific American
سال: 1913
ISSN: 0036-8733
DOI: 10.1038/scientificamerican03151913-240